Here we're going to look at an application of the k-nearest neighbours (kNN) algorithm to predict whether or not a telescope signal is gamma or hadron radiation using a Kaggle dataset. This is one of the older ones. I've just looked it up and the internet assures me that this was developed in the 1950s. It still works well today. I'll be using the scikit-learn kNN classification model for the example.

Step 1: We will use the python package NumPy for working with a sample dataset and Matplotlib to plot various graphs for visualisation. Step 2: Let us consider a simple scenario where a single input /independent variable controls the outcome/dependent variable value. In the code below, we have declared two NumPy arrays to hold the values of the independent and dependent variables. Step 3: Let us quickly draw a scatter plot to understand the data points. Our goal is to formulate a linear equation which can predict the dependent variable value with minimum error for an independent/input variable.

Over the past three to four years, there has been an evolving breakthrough in the world of technology. This has put into great knowledge on how powerful machines can become in making decisions based completely on facts and figures that have been around for centuries‐ a feat not totally possible with any amount of human effort. This movement in the world of technology (understanding of data) has led to many studies that individually make dramatic progress in improving the world. One of these areas is what has been known as Deep Learning. But what exactly is it?

Linear regression is used for finding linear relationship between target and one or more predictors. There are two types of linear regression- Simple and Multiple. Simple linear regression is useful for finding relationship between two continuous variables. One is predictor or independent variable and other is response or dependent variable. It looks for statistical relationship but not deterministic relationship.

This paper describes a generalization of previous methods for constructing tree-structured belief network with hidden variables. The major new feature of the described method is the ability to produce a tree decomposition even when there are errors in the correlation data among the input variables. This is an important extension of existing methods since the correlational co efficients usually cannot be measured with precision. The technique involves using a greedy search algorithm that locally minimizes an error function.